منابع مشابه
The Algorithmic Complexity of k-Domatic Partition of Graphs
Let G = (V,E) be a simple undirected graph, and k be a positive integer. A k-dominating set of G is a set of vertices S ⊆ V satisfying that every vertex in V \ S is adjacent to at least k vertices in S. A k-domatic partition of G is a partition of V into k-dominating sets. The k-domatic number of G is the maximum number of k-dominating sets contained in a k-domatic partition of G. In this paper...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملDomatic partitions of computable graphs
Given a graph G, we say that a subset D of the vertex set V is a dominating set if it is near all the vertices, in that every vertex outside of D is adjacent to a vertex in D. A domatic k-partition of G is a partition of V into k dominating sets. In this paper, we will consider issues of computability related to domatic partitions of computable graphs. Our investigation will center on answering...
متن کاملThe Pk Partition Problem and Related Problems in Bipartite Graphs
In this paper, we continue the investigation proposed in [15] about the approximability of Pk partition problems, but focusing here on their complexity. More precisely, we prove that the problem consisting of deciding if a graph of nk vertices has n vertex disjoint simple paths {P1, · · · , Pn} such that each path Pi has k vertices is NP-complete, even in bipartite graphs of maximum degree 3. N...
متن کاملThe Path-partition Problem in Bipartite Distance-hereditary Graphs
A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Journal of Applied Sciences, Engineering and Technology
سال: 2013
ISSN: 2040-7459,2040-7467
DOI: 10.19026/rjaset.5.5002